Edge-Constrained Marching Triangles
نویسندگان
چکیده
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marching Triangles algorithm where the inputs are multiple range images of scenes. C discontinuities (fold edges) are detected and used to constrain the final triangulation, thus increasing the accuracy of the mesh at sharp edges and corners and decreasing the number of triangles with a poor aspect ratio.
منابع مشابه
Surface Curvature Estimation for Edge Spinning Algorithm
This paper presents an adaptive modification of the Edge spinning method for polygonization of implicit surfaces. The method insists on the shape of triangles and the accuracy of resulting approximation as well. The main advantages of the triangulation presented are simplicity and the stable features that can be used for next expanding. The implementation is not complicated and only the standar...
متن کاملPolygonization by the Edge Spinning
This paper presents a new method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles of the resulting polygonal mesh. The main advantages of the triangulation presented are simplicity and the stable features that can be used for next expanding. The implementation is not complicated and only the standard data structures are used. This algorithm is based on ...
متن کاملCurvature Dependent Polygonization by the Edge Spinning
An adaptive method for polygonization of implicit surfaces is presented. The method insists on the shape of triangles and the accuracy of resulting approximation as well. The presented algorithm is based on the surface tracking scheme and it is compared with the other algorithms based on the similar principle, such as the Marching cubes and the Marching triangles methods. The main advantages of...
متن کاملPolygonisation of disjoint implicit surfaces by the adaptive edge spinning algorithm of implicit objects
This paper presents an adaptive method for polygonisation of implicit surfaces. The method is based on the shape of triangles and the accuracy of resulting approximation. The main advantages of the triangulation presented are simplicity and the stable features that can be used for the next expansion. The presented algorithm is based on the surface tracking scheme, and it is compared with other ...
متن کاملAdaptive Implicit Surface Polygonization Using Marching Triangles
This paper presents several improvements to the marching triangles algorithm for general implicit surfaces. The original method generates equilateral triangles of constant size almost everywhere on the surface. We present several modifications to adapt the size of the triangles to the curvature of the surface. As cracks may arise in the resulting polygonization, we propose a specific crack-clos...
متن کامل